Solving 10385 - Duathlon (Ternary search)
[andmenj-acm.git] / 11847 - Cut the Silver Bar / 11847.cpp
blobb8e74234adb071532e949d6e943ec0fbd835b3ac
1 using namespace std;
2 #include <algorithm>
3 #include <iostream>
4 #include <iterator>
5 #include <numeric>
6 #include <sstream>
7 #include <fstream>
8 #include <cassert>
9 #include <climits>
10 #include <cstdlib>
11 #include <cstring>
12 #include <string>
13 #include <cstdio>
14 #include <vector>
15 #include <cmath>
16 #include <queue>
17 #include <deque>
18 #include <stack>
19 #include <list>
20 #include <map>
21 #include <set>
23 #define foreach(x, v) for (typeof (v).begin() x=(v).begin(); x !=(v).end(); ++x)
24 #define For(i, a, b) for (int i=(a); i<(b); ++i)
25 #define D(x) cout << #x " is " << x << endl
27 int main(){
28 int n;
29 while (cin >> n) {
30 if (n == 0) break;
32 int ans = 0;
33 while (n > 1) {
34 n /= 2;
35 ans++;
38 printf("%d\n", ans);
40 return 0;